Primal-dual active set strategy for large scale optimization of cardiac defibrillation
نویسندگان
چکیده
منابع مشابه
Primal-dual active set strategy for large scale optimization of cardiac defibrillation
In this paper, the feasible study of the optimal control techniques for the cardiac defibrillation on the anatomical three spatial dimensional rabbit ventricle geometry in the presence of bilateral control constraints. The present work addresses the numerical treatment of multiscale and multidomain simulations of bidomain equations, the description of deriving optimality system, the applicabili...
متن کاملA globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
We present a primal-dual active-set framework for solving large-scale convex quadratic optimization problems (QPs). In contrast to classical active-set methods, our framework allows for multiple simultaneous changes in the active-set estimate, which often leads to rapid identification of the optimal active-set regardless of the initial estimate. The iterates of our framework are the active-set ...
متن کاملLarge-scale optimization with the primal-dual column generation method
The primal-dual column generation method (PDCGM) is a general-purpose column generation technique that relies on the primal-dual interior point method to solve the restricted master problems. The use of this interior point method variant allows to obtain suboptimal and well-centered dual solutions which naturally stabilizes the column generation. A reduction in the number of calls to the oracle...
متن کاملA Primal Dual Active Set Algorithm for a Class of Nonconvex Sparsity Optimization
In this paper, we consider the problem of recovering a sparse vector from noisy measurement data. Traditionally, it is formulated as a penalized least-squares problem with an `1 penalty. Recent studies show that nonconvex penalties, e.g., `0 and bridge, allow more effective sparse recovery. We develop an algorithm of primal dual active set type for a class of nonconvex sparsity-promoting penalt...
متن کاملPrimal and dual active-set methods for convex quadratic programming
Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints and simple lower bounds on the variables. In the first part of the paper, two methods are proposed, one primal and one dual. These methods generate a sequence of iterates that are feasible with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2017
ISSN: 0096-3003
DOI: 10.1016/j.amc.2016.07.035